منابع مشابه
Traversing Directed Eulerian Mazes
The paper describes two algorithms for threading unknown, finite directed Eulerian mazes. Each of these algorithms is performed by a traveling robot whose control is a finite-state automaton. It is assumed that each vertex has a circular list of its outgoing edges. The items of this list are called exits. Each of the algorithms puts in one of the exits of each vertex a scan pebble. These pebble...
متن کاملTraversing psychological distance.
Traversing psychological distance involves going beyond direct experience, and includes planning, perspective taking, and contemplating counterfactuals. Consistent with this view, temporal, spatial, and social distances as well as hypotheticality are associated, affect each other, and are inferred from one another. Moreover, traversing all distances involves the use of abstraction, which we def...
متن کاملTraversing Symmetric Polyhedral Fans
We propose an algorithm for computing the facets of a pure connected polyhedral fan up to symmetry. The fan is represented by an oracle. With suitable implementations of the oracle the same algorithm can be used for computing secondary fans, Gröbner fans, Tropical varieties and Minkowski sums up to symmetry. The algorithm has been implemented in the software Gfan.
متن کاملTraversing the Machining Graph
Zigzag pocket machining (or 2D-milling) plays an important role in the manufacturing industry. The objective is to minimize the number of tool retractions in the zigzag machining path for a given pocket (i.e., a planar domain). We give an optimal linear time dynamic programming algorithm for simply connected pockets, and a linear plus O(1) time optimal algorithm for pockets with h holes. If the...
متن کاملTraversing Probabilistic Graphs
The problem of traversing probabilistic graphs has been studied for a long time. This is because most of the graphs that we come across, whether it is a network of roads or a set of network links are probabilistic in nature. A probabilistic graph is one where there is a probability associated with the existence of every edge. We examine the problem of nding the best strategy for reaching a give...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Social Analysis
سال: 2020
ISSN: 0155-977X,1558-5727
DOI: 10.3167/sa.2020.640107